Search results for "Bidirectional traffic"
showing 4 items of 4 documents
The role of the Access Point in Wi-Fi networks with selfish nodes
2009
In Wi-Fi networks, mobile nodes compete for accessing the shared channel by means of a random access protocol called Distributed Coordination Function (DCF), which is long term fair. But recent drivers allow users to configure protocol parameters differently from their standard values in order to break the protocol fairness and obtain a larger share of the available bandwidth at the expense of other users. This motivates a game theoretical analysis of DCF. Previous studies have already modeled access to a shared wireless channel in terms of non-cooperative games among the nodes, but they have mainly considered ad hoc mode operation. In this paper we consider the role of the Access Point (AP…
Resource sharing optimality in WiFi infrastructure networks
2009
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios. Assuming that a contending node can dynamically change its strategy, by tuning its contention parameters to non-standard values on the basis of channel observations, we prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium condi…
Performance analysis of selfish access strategies on WiFi infrastructure networks
2009
In this paper we propose a game-theoretic approach for characterizing WiFi network performance in presence of intelligent nodes employing cognitive functionalities. We assume that a cognitive WiFi node is aware of its application requirements and is able to dynamically estimate the network status, in order to dynamically change its access strategy by tuning the contention window settings. We prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium conditions, which are also Pareto optimal. Indeed, we show that the station strategies converge toward values which maximize a per-node uti…
Improving IEEE 802.11 Performance in Chain Topologies through Distributed Polling and Network Coding
2009
Wireless multi-hop networks often rely on the use of IEEE 802.11 technology. Despite of the robustness of the IEEE 802.11 Distributed Coordination Function (DCF) for working in various network scenarios, it has been proven that critical inefficiencies can arise in the case of multi-hop packet forwarding. In this paper, we propose a MAC scheme, based on the virtualization of the Point Coordination Function, optimized for working on chain topologies with bidirectional traffic flows. Our scheme is based on a token-like access mechanism coupled with network coding. The basic idea is the use of multiple Point Coordinators (PCs) along the node chain, which are elected by passing special token fra…